Combining Interval Constraint Solving Methods
نویسنده
چکیده
This paper discusses the combination of interval methods for solving nonlinear systems, and focuses on interval-based local consistencies and the multidimensional interval Newton method. The existing algorithms are revised in order to introduce a more cooperative strategy of application of elementary solvers that may prevent slow convergence phenomena and unnecessary computations. A set of experiments for comparing several algorithms is reported.
منابع مشابه
Providing a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach
Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...
متن کاملAn introduction to interval-based constraint processing
Constraint programming is often associated with solving problems over finite domains. Many applications in engineering, CAD and design, however, require solving problems over continuous (real-valued) domains. While simple constraint solvers can solve linear constraints with the inaccuracy of floating-point arithmetic, methods based on interval arithmetic allow exact (interval) solutions over a ...
متن کاملToward Adaptive Cooperation between Global and Local Solvers for Continuous Constraint Problems
Search methods for solving continuous constraint problems can be broadly divided into two categories: global search and local search methods. Global search methods spend a great amount of effort exploring the global search space, whereas local search methods focus on converging to local optimal solutions. Although these methods alone work well on many problems, there are many others that will b...
متن کاملParallel Implementation of Interval Analysis for Equations Solving
alias is a C++ library implementing interval analysis and constraint programming methods for studying and solving set of equation over the reals. In this paper, we describes a distributed implementation of the library.
متن کاملSpatial Inference - Learning vs. Constraint Solving
We present a comparison of two new approaches for solving constraints occurring in spatial inference. In contrast to qualitative spatial reasoning we use a metric description, where relations between pairs of objects are represented by parameterized homogenous transformation matrices with numerical (nonlinear) constraints. We employ interval arithmetics based constraint solving and methods of m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000